Planning with Numeric Varibles in Multiobjective Planning
نویسندگان
چکیده
The purely propositional representation traditionally used to express AI planning problems is not adequate to express numeric variables when modeling real-world continuous resources. This paper presents a heuristic planning approach that uses a richer representation with capabilities for numeric variables, including durations of actions, and multiobjective optimisation. The approach consists of two stages. First, a spike construction process estimates the values of the variables associated with propositions/actions, without relaxing numeric effects in the calculus of the estimation. Second, a heuristic search process generates a relaxed plan according to the estimations of the first stage, and then performs search in a plan space. The relaxed plan and the heuristic estimations help the process find a plan while trying to optimise the multiobjective criterion.
منابع مشابه
A Planning Approach to Deal with Numeric Variables in Multiobjective Planning
Planning problems have been traditionally expressed by a propositional representation. However, this representation is not adequate to express numeric variables when modeling realworld continuous resources, such as fuel consumption, energy level, profit, etc. This paper presents our ongoing work to build a planner with capabilities for numeric variables, including duration on actions, and multi...
متن کاملInterval Based Relaxation Heuristics for Numeric Planning with Action Costs
Many real-world problems can be expressed in terms of states and actions that modify the world to reach a certain goal. Such problems can be solved by automated planning. Numeric planning supports numeric quantities such as resources or physical properties in addition to the propositional variables from classical planning. We approach numeric planning with heuristic search and introduce adaptat...
متن کاملNumeric Planning via Search Space Abstraction
Many real-world planning problems are best modeled as infinite search space problems, using numeric fluents. Unfortunately, most planners and planning heuristics do not directly support such fluents. We propose a search space abstraction technique that compiles a planning problem with numeric fluents into a finite state propositional planning problem. To account for the loss of precision result...
متن کاملComplexity Issues of Interval Relaxed Numeric Planning
Automated planning is a hard problem even in its most basic form as STRIPS planning. We are interested in numeric planning tasks with instantaneous actions, a problem which is not even decidable in general. Relaxation is an approach to simplifying complex problems in order to obtain guidance in the original problem. We present a relaxation approach with intervals for numeric planning and discus...
متن کاملComplexity of Interval Relaxed Numeric Planning
Automated planning is computationally hard even in its most basic form as STRIPS planning. We are interested in numeric planning with instantaneous actions, a problem that is not decidable in general. Relaxation is an approach to simplifying complex problems in order to obtain guidance in the original problem. We present a relaxation approach with intervals for numeric planning and show that pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004